Answer Set Planning Under Action Costs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Answer Set Planning under Action Costs

More recently, planning based on answer set programming has been proposed as an approach towards realizing declarative planning systems. In this paper, we present the language K , which extends the declarative planning language K by action costs and provides the notion of admissible and optimal plans, which are plans whose overall action costs are within a given limit resp. minimum over all pla...

متن کامل

Planning in Answer Set Programming while Learning Action Costs for Mobile Robots

For mobile robots to perform complex missions, it may be necessary for them to plan with incomplete information and reason about the indirect effects of their actions. Answer Set Programming (ASP) provides an elegant way of formalizing domains which involve indirect effects of an action and recursively defined fluents. In this paper, we present an approach that uses ASP for robotic task plannin...

متن کامل

Answer Set Planning

In \answer set programming," solutions to a problem are represented by answer sets, and not by answer substitutions produced in response to a query, as in conventional logic programming. Instead of Prolog, answer set programming uses software systems capable of computing answer sets. This paper is about applications of this idea to planning.

متن کامل

Adding Preferences to Answer Set Planning

Planning—in its classical sense—is the problem of finding a sequence of actions that achieves a predefined goal. As such, much of the research in AI planning has been focused on methodologies and issues related to the development of efficient planners. To date, several efficient planning systems have been developed (e.g., see [3] for a summary of planners that competed in the International Conf...

متن کامل

Hybrid conditional planning using answer set programming

We introduce a parallel offline algorithm for computing hybrid conditional plans, called HCP-ASP, oriented towards robotics applications. HCP-ASP relies on modeling actuation actions and sensing actions in an expressive nonmonotonic language of answer set programming (ASP), and computation of the branches of a conditional plan in parallel using an ASP solver. In particular, thanks to external a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Artificial Intelligence Research

سال: 2003

ISSN: 1076-9757

DOI: 10.1613/jair.1148